|
In graph theory, the generalized Petersen graphs are a family of cubic graphs formed by connecting the vertices of a regular polygon to the corresponding vertices of a star polygon. They include the Petersen graph and generalize one of the ways of constructing the Petersen graph. The generalized Petersen graph family was introduced in 1950 by H. S. M. Coxeter〔.〕 and these graphs were given their name in 1969 by Mark Watkins.〔.〕 ==Definition and notation== In Watkins' notation, ''G''(''n'',''k'') is a graph with vertex set : and edge set : where subscripts are to be read modulo ''n'' and ''k'' < ''n''/2. Some authors use a similar notation ''GPG''(''n'',''k'') with the same meaning.Coxeter's notation for the same graph would be +, a combination of the Schläfli symbols for the regular ''n''-gon and star polygon from which the graph is formed. Any generalized Petersen graph can also be constructed as a voltage graph from a graph with two vertices, two self-loops, and one other edge.〔. Example 2.1.2, p.58.〕 The Petersen graph itself is ''G''(5,2) or +. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Generalized Petersen graph」の詳細全文を読む スポンサード リンク
|